منابع مشابه
Robustness and Security of Digital Watermarks
Digital watermarking is a nascent but promising technology that offers protection of unencrypted digital content. This paper is a brief technical survey of the multimedia watermarking landscape. The three main technical challenges faced by watermarking algorithms are fidelity, robustness and security. Current watermarking methods offer possibly acceptable fidelity and robustness against certain...
متن کاملAnalysis of Response Robustness for a Multi-Objective Mathematical Model of Dynamic Cellular Manufacturing
The multi-objective optimization problem is the main purpose of generating an optimal set of targets known as Pareto optimal frontier to be provided the ultimate decision-makers. The final selection of point of Pareto frontier is usually made only based on the goals presented in the mathematical model to implement the considered system by the decision-makers. In this paper, a mathematical model...
متن کاملRobustness Enhancement of Content-Based Watermarks Using Entropy Masking Effect
Image-Adaptive watermarking systems exploit visual models to adapt the watermark to local properties of the host image. This leads to a watermark power enhancement, hence an improved resilience against different attacks, while keeping the mark imperceptible. Visual models consider different properties of the human visual system, such as frequency sensitivity, luminance sensitivity and contrast ...
متن کاملIncreasing Robustness of Image Watermarks to Counterfeit Attacks
Several watermarking schemes have been proposed in recent years with proven robustness to many types of intentional and unintentional signal processing attacks. However very few investigators [1, 2] have addressed the question of \unambiguous resolution of ownership with digital watermarks". In this paper we extend the work of Craver et. al. [1]. We show how a pirate can engineer an attack agai...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bezopasnost informacionnyh tehnology
سال: 2017
ISSN: 2074-7136,2074-7128
DOI: 10.26583/bit.2017.2.08